A new fast technique for pattern matching in biological sequences

Abstract At numerous phases of the computational process, pattern matching is essential. It enables users to search for specific DNA subsequences or sequences in a database. In addition, some these rapidly expanding biological databases are updated on regular basis. Pattern searches can be improved by using high-speed algorithms. Researchers striving improve solutions areas bioinformatics as data grows exponentially. Faster algorithms with low error rate needed real-world applications. As result, this study offers two that were created help speed up sequence searches. The strategies recommended performance utilizing word-level processing rather than character-level processing, which has been used previous research studies. terms time cost, proposed (EFLPM and EPAPM) increased leveraging large size. experimental results show methods faster other short long patterns. EFLPM algorithm 54% FLPM method, while EPAPM 39% PAPM method.